>>> fplll: Building testing/fplll 5.4.5-r0 (using abuild 3.12.0-r0) started Sun, 22 Oct 2023 18:10:42 +0000 >>> fplll: Checking sanity of /home/buildozer/aports/testing/fplll/APKBUILD... >>> WARNING: fplll: No maintainer >>> fplll: Analyzing dependencies... >>> fplll: Installing for build: build-base gmp-dev mpfr-dev libqd-dev (1/7) Installing libgmpxx (6.3.0-r0) (2/7) Installing gmp-dev (6.3.0-r0) (3/7) Installing mpfr-dev (4.2.1-r0) (4/7) Installing libgfortran (13.2.1_git20231014-r0) (5/7) Installing libqd (2.3.23-r2) (6/7) Installing libqd-dev (2.3.23-r2) (7/7) Installing .makedepends-fplll (20231022.181042) Executing busybox-1.36.1-r13.trigger OK: 322 MiB in 109 packages >>> fplll: Cleaning up srcdir >>> fplll: Cleaning up pkgdir >>> fplll: Cleaning up tmpdir >>> fplll: Fetching https://distfiles.alpinelinux.org/distfiles/edge/fplll-5.4.5.tar.gz >>> fplll: Fetching https://distfiles.alpinelinux.org/distfiles/edge/fplll-5.4.5.tar.gz >>> fplll: Checking sha512sums... fplll-5.4.5.tar.gz: OK >>> fplll: Unpacking /var/cache/distfiles/fplll-5.4.5.tar.gz... checking whether to enable maintainer-specific portions of Makefiles... yes checking build system type... armv6-alpine-linux-musleabihf checking host system type... armv6-alpine-linux-musleabihf checking target system type... armv6-alpine-linux-musleabihf checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... ./install-sh -c -d checking for gawk... no checking for mawk... no checking for nawk... no checking for awk... awk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking whether make supports nested variables... (cached) yes checking how to print strings... printf checking whether make supports the include directive... yes (GNU style) checking for armv6-alpine-linux-musleabihf-gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking whether gcc understands -c and -o together... yes checking dependency style of gcc... gcc3 checking for a sed that does not truncate output... /bin/sed checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking for fgrep... /bin/grep -F checking for ld used by gcc... /usr/armv6-alpine-linux-musleabihf/bin/ld checking if the linker (/usr/armv6-alpine-linux-musleabihf/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 98304 checking how to convert armv6-alpine-linux-musleabihf file names to armv6-alpine-linux-musleabihf format... func_convert_file_noop checking how to convert armv6-alpine-linux-musleabihf file names to toolchain format... func_convert_file_noop checking for /usr/armv6-alpine-linux-musleabihf/bin/ld option to reload object files... -r checking for armv6-alpine-linux-musleabihf-objdump... no checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for armv6-alpine-linux-musleabihf-dlltool... no checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for armv6-alpine-linux-musleabihf-ar... no checking for ar... ar checking for archiver @FILE support... @ checking for armv6-alpine-linux-musleabihf-strip... no checking for strip... strip checking for armv6-alpine-linux-musleabihf-ranlib... no checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc object... ok checking for sysroot... no checking for a working dd... /bin/dd checking how to truncate binary pipes... /bin/dd bs=4096 count=1 checking for armv6-alpine-linux-musleabihf-mt... no checking for mt... no checking if : is a manifest tool... no checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for dlfcn.h... yes checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/armv6-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking whether -lc should be explicitly linked in... no checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... yes checking whether to build static libraries... yes checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... gcc3 checking how to run the C++ preprocessor... g++ -E checking for ld used by g++... /usr/armv6-alpine-linux-musleabihf/bin/ld checking if the linker (/usr/armv6-alpine-linux-musleabihf/bin/ld) is GNU ld... yes checking whether the g++ linker (/usr/armv6-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ linker (/usr/armv6-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking dynamic linker characteristics... (cached) GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for armv6-alpine-linux-musleabihf-gcc... (cached) gcc checking whether the compiler supports GNU C... (cached) yes checking whether gcc accepts -g... (cached) yes checking for gcc option to enable C11 features... (cached) none needed checking whether gcc understands -c and -o together... (cached) yes checking dependency style of gcc... (cached) gcc3 checking whether make sets $(MAKE)... (cached) yes checking whether g++ supports C++11 features with -std=c++11... yes checking for __gmp_get_memory_functions in -lgmp... yes checking for mpfr_fms in -lmpfr... yes checking for armv6-alpine-linux-musleabihf-pkg-config... no checking for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking for qd... yes checking for limits.h... yes checking for cstdio... yes checking for iostream... yes checking for string... yes checking for limits... yes checking for vector... yes checking for _Bool... no checking for stdbool.h that conforms to C99... yes checking for an ANSI C-conforming const... yes checking for inline... inline checking for size_t... yes checking for working volatile... yes checking for working strtod... yes checking for floor... yes checking for pow... yes checking for rint... yes checking for sqrt... yes checking for strtol... yes checking how to run the C preprocessor... gcc -E checking whether gcc is Clang... no checking whether pthreads work with "-pthread" and "-lpthread"... yes checking for joinable pthread attribute... PTHREAD_CREATE_JOINABLE checking whether more special flags are required for pthreads... no checking for PTHREAD_PRIO_INHERIT... yes checking whether std::atomic can be used without link library... yes checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating fplll/Makefile config.status: creating tests/Makefile config.status: creating fplll.pc config.status: creating config.h config.status: creating fplll/fplll_config.h config.status: executing depfiles commands config.status: executing libtool commands make all-recursive make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' Making all in fplll make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make all-am make[3]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' CXX main.o CXX libfplll_la-fplll.lo CXX libfplll_la-util.lo CXX libfplll_la-lll.lo CXX libfplll_la-wrapper.lo CXX libfplll_la-bkz.lo CXX libfplll_la-bkz_param.lo CXX libfplll_la-gso_interface.lo CXX libfplll_la-gso_gram.lo CXX libfplll_la-gso.lo CXX libfplll_la-hlll.lo CXX libfplll_la-householder.lo CXX libfplll_la-threadpool.lo CXX latticegen.o CXX enum/libfplll_la-topenum.lo CXX enum/libfplll_la-enumerate.lo CXX enum/libfplll_la-enumerate_base.lo CXX enum/libfplll_la-enumerate_ext.lo CXX enum/libfplll_la-evaluator.lo CXX pruner/libfplll_la-pruner.lo CXX pruner/libfplll_la-pruner_cost.lo CXX pruner/libfplll_la-pruner_optimize.lo CXX pruner/libfplll_la-pruner_optimize_tc.lo CXX pruner/libfplll_la-pruner_optimize_tp.lo CXX pruner/libfplll_la-pruner_prob.lo CXX pruner/libfplll_la-pruner_util.lo CXX enum-parallel/libfplll_la-enumlib.lo CXX enum-parallel/libfplll_la-enumlib_dim.160.lo CXX enum-parallel/libfplll_la-enumlib_dim.150.lo CXX enum-parallel/libfplll_la-enumlib_dim.140.lo CXX enum-parallel/libfplll_la-enumlib_dim.130.lo CXX enum-parallel/libfplll_la-enumlib_dim.120.lo CXX enum-parallel/libfplll_la-enumlib_dim.110.lo CXX enum-parallel/libfplll_la-enumlib_dim.100.lo CXX enum-parallel/libfplll_la-enumlib_dim.90.lo CXX enum-parallel/libfplll_la-enumlib_dim.80.lo CXX enum-parallel/libfplll_la-enumlib_dim.70.lo CXX enum-parallel/libfplll_la-enumlib_dim.60.lo CXX enum-parallel/libfplll_la-enumlib_dim.50.lo CXX enum-parallel/libfplll_la-enumlib_dim.40.lo CXX enum-parallel/libfplll_la-enumlib_dim.30.lo CXX enum-parallel/libfplll_la-enumlib_dim.20.lo In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from pruner/pruner.h:21, from bkz_param.h:24, from bkz_param.cpp:2: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {double&}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams&}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from pruner/pruner.h:21, from bkz_param.h:24, from bkz.h:21, from fplll.h:25, from main.h:21, from main.cpp:18: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void read_pruning_vector(const char*, fplll::PruningParams&, int)' at main.cpp:106:30: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at bkz_param.h:130:56, inlined from 'int bkz(Options&, fplll::ZZ_mat&) [with ZT = __mpz_struct [1]]' at main.cpp:134:42: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from pruner/pruner.h:21, from bkz_param.h:24, from bkz.h:21, from fplll.h:25, from fplll.cpp:18: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'int fplll::shortest_vector_ex(ZZ_mat<__mpz_struct [1]>&, std::vector, std::allocator > >&, SVPMethod, const std::vector&, int, EvaluatorMode, long long int&, std::vector, std::allocator > > >*, std::vector*, std::vector, std::allocator > > >*, std::vector*, int)' at svpcvp.cpp:226:29: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {nlohmann::basic_json, std::allocator >, bool, long long int, long long unsigned int, double, std::allocator>}; _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {nlohmann::basic_json, std::allocator >, bool, long long int, long long unsigned int, double, std::allocator>}; _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'void nlohmann::basic_json::push_back(nlohmann::basic_json&&) [with ObjectType = std::map; ArrayType = std::vector; StringType = std::__cxx11::basic_string; BooleanType = bool; NumberIntegerType = long long int; NumberUnsignedType = long long unsigned int; NumberFloatType = double; AllocatorType = std::allocator]' at io/json.hpp:4905:33, inlined from 'nlohmann::basic_json nlohmann::basic_json::parser::parse_internal(bool) [with ObjectType = std::map; ArrayType = std::vector; StringType = std::__cxx11::basic_string; BooleanType = bool; NumberIntegerType = long long int; NumberUnsignedType = long long unsigned int; NumberFloatType = double; AllocatorType = std::allocator]' at io/json.hpp:9157:45: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'int fplll::shortest_vector_ex(MatGSOInterface, FP_NR<__mpfr_struct [1]> >&, std::vector, std::allocator > >&, SVPMethod, const std::vector&, int, EvaluatorMode, long long int&, std::vector, std::allocator > > >*, std::vector*, std::vector, std::allocator > > >*, std::vector*, int, bool)' at svpcvp.cpp:422:29: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double&}; _Tp = double; _Alloc = std::allocator]', inlined from 'std::vector fplll::load_strategies_json(const std::string&)' at bkz_param.cpp:135:44: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams&}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'std::vector fplll::load_strategies_json(const std::string&)' at bkz_param.cpp:142:49: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'std::vector fplll::load_strategies_json(const std::string&)' at bkz_param.cpp:153:42: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.20.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from nr/matrix.h:21, from gso_interface.h:22, from gso.h:21, from gso.cpp:20: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from pruner/pruner.h:21, from bkz_param.h:24, from bkz.h:21, from bkz.cpp:20: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at bkz_param.h:130:56: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.30.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from nr/matrix.h:21, from gso_interface.h:22, from gso_interface.cpp:21: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.40.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSOInterface::babai(std::vector&, int, int) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso_interface.cpp:291:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.50.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.60.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const fplll::FP_NR&}; _Tp = fplll::FP_NR; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = fplll::FP_NR; _Alloc = std::allocator >]', inlined from 'void fplll::MatGSO::babai(std::vector&, int, int, bool) [with ZT = fplll::Z_NR; FT = fplll::FP_NR]' at gso.cpp:489:16: /usr/include/c++/13.2.1/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.70.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.80.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from pruner/pruner.h:21, from pruner/pruner.cpp:16: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.90.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.100.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.110.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:61, from /usr/include/c++/13.2.1/algorithm:61, from ../fplll/defs.h:31, from enum-parallel/fplll_types.h:28, from enum-parallel/enumeration.h:28, from enum-parallel/enumlib_dim.cpp:30, from enum-parallel/enumlib_dim.120.cpp:2: /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Tp = pair, pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 10; bool svp = true; int swirlid = 0; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 9; bool svp = true; int swirlid = 1; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 10; bool svp = true; int swirlid = 0; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 9; bool svp = true; int swirlid = 1; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 11; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 11; bool svp = true; int swirlid = 0; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 10; bool svp = true; int swirlid = 1; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 11; bool svp = true; int swirlid = 0; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 10; bool svp = true; int swirlid = 1; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 12; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 12; bool svp = true; int swirlid = 0; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 11; bool svp = true; int swirlid = 1; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 12; bool svp = true; int swirlid = 0; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 11; bool svp = true; int swirlid = 1; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 13; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 13; bool svp = true; int swirlid = 0; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 12; bool svp = true; int swirlid = 1; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 13; bool svp = true; int swirlid = 0; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 12; bool svp = true; int swirlid = 1; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 14; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 14; bool svp = true; int swirlid = 0; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 13; bool svp = true; int swirlid = 1; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 14; bool svp = true; int swirlid = 0; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 13; bool svp = true; int swirlid = 1; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 15; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 15; bool svp = true; int swirlid = 0; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 14; bool svp = true; int swirlid = 1; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 15; bool svp = true; int swirlid = 0; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 14; bool svp = true; int swirlid = 1; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 16; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 0; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 15; bool svp = true; int swirlid = 1; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 0; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 15; bool svp = true; int swirlid = 1; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 17; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 0; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 1; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 0; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 1; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 18; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 0; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 1; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 0; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 1; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 19; int SWIRLY = 1; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 0; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirl = 18; int swirlid = 0; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 1; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirl = 16; int swirlid = 1; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 0; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirl = 18; int swirlid = 0; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 16; bool svp = true; int swirlid = 1; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirl = 16; int swirlid = 1; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 20; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirlid = 0; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirl = 19; int swirlid = 0; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 1; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirl = 17; int swirlid = 1; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirlid = 0; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirl = 19; int swirlid = 0; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 17; bool svp = true; int swirlid = 1; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirl = 17; int swirlid = 1; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 21; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirlid = 0; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirl = 20; int swirlid = 0; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 1; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirl = 18; int swirlid = 1; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirlid = 0; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirl = 20; int swirlid = 0; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 18; bool svp = true; int swirlid = 1; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirl = 18; int swirlid = 1; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 22; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirlid = 0; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirl = 21; int swirlid = 0; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirlid = 1; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirl = 19; int swirlid = 1; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirlid = 0; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirl = 21; int swirlid = 0; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 19; bool svp = true; int swirlid = 1; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirl = 19; int swirlid = 1; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 23; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirlid = 0; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirl = 22; int swirlid = 0; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirlid = 1; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirl = 20; int swirlid = 1; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirlid = 0; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirl = 22; int swirlid = 0; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 20; bool svp = true; int swirlid = 1; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirl = 20; int swirlid = 1; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 24; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirlid = 0; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirl = 23; int swirlid = 0; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirlid = 1; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirl = 21; int swirlid = 1; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirlid = 0; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirl = 23; int swirlid = 0; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 21; bool svp = true; int swirlid = 1; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirl = 21; int swirlid = 1; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 25; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirlid = 0; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirl = 24; int swirlid = 0; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirlid = 1; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirl = 22; int swirlid = 1; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirlid = 0; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirl = 24; int swirlid = 0; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 22; bool svp = true; int swirlid = 1; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirl = 22; int swirlid = 1; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 26; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirlid = 0; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirl = 25; int swirlid = 0; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirlid = 1; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirl = 23; int swirlid = 1; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirlid = 0; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirl = 25; int swirlid = 0; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 23; bool svp = true; int swirlid = 1; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirl = 23; int swirlid = 1; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 27; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirlid = 0; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirl = 26; int swirlid = 0; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirlid = 1; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirl = 24; int swirlid = 1; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirlid = 0; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirl = 26; int swirlid = 0; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 24; bool svp = true; int swirlid = 1; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirl = 24; int swirlid = 1; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 28; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirlid = 0; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirl = 27; int swirlid = 0; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirlid = 1; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirl = 25; int swirlid = 1; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirlid = 0; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirl = 27; int swirlid = 0; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 25; bool svp = true; int swirlid = 1; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirl = 25; int swirlid = 1; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 29; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirlid = 0; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirl = 28; int swirlid = 0; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirlid = 1; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirl = 26; int swirlid = 1; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirlid = 0; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirl = 28; int swirlid = 0; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 26; bool svp = true; int swirlid = 1; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirl = 26; int swirlid = 1; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 30; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirlid = 0; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirl = 29; int swirlid = 0; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirlid = 1; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirl = 27; int swirlid = 1; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirlid = 0; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirl = 29; int swirlid = 0; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 27; bool svp = true; int swirlid = 1; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirl = 27; int swirlid = 1; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 31; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirlid = 0; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirl = 30; int swirlid = 0; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirlid = 1; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirl = 28; int swirlid = 1; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirlid = 0; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirl = 30; int swirlid = 0; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 28; bool svp = true; int swirlid = 1; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirl = 28; int swirlid = 1; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 32; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirlid = 0; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirl = 31; int swirlid = 0; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirlid = 1; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirl = 29; int swirlid = 1; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirlid = 0; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirl = 31; int swirlid = 0; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 29; bool svp = true; int swirlid = 1; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirl = 29; int swirlid = 1; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 33; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirlid = 0; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirl = 32; int swirlid = 0; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirlid = 1; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirl = 30; int swirlid = 1; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirlid = 0; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirl = 32; int swirlid = 0; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 30; bool svp = true; int swirlid = 1; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirl = 30; int swirlid = 1; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 34; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirlid = 0; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirl = 33; int swirlid = 0; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirlid = 1; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirl = 31; int swirlid = 1; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirlid = 0; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirl = 33; int swirlid = 0; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 31; bool svp = true; int swirlid = 1; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirl = 31; int swirlid = 1; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 35; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 0; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 0; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirlid = 1; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirl = 32; int swirlid = 1; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 0; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 0; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 32; bool svp = true; int swirlid = 1; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirl = 32; int swirlid = 1; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 36; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 0; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 0; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirlid = 1; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirl = 33; int swirlid = 1; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 0; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 0; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 33; bool svp = true; int swirlid = 1; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirl = 33; int swirlid = 1; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 37; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirlid = 0; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 36; int swirlid = 0; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 1; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 1; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirlid = 0; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 36; int swirlid = 0; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 1; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 1; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 38; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 0; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 0; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 1; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 1; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 39; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 0; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 0; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 1; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 1; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 39; int SWIRLY = 2; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 37; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 34; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 37; int swirlid = 0; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 34; bool svp = true; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirl = 34; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 34; int swirlid = 1; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 40; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 40; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1283 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1283:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2401 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 38; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 38; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 35; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2401:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 38; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 38; int swirlid = 0; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 35; bool svp = true; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirl = 35; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 35; int swirlid = 1; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 41; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 41; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2477 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2477:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2517:15: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2518:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2519 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2520:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2521 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 39; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 39; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 36; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 36; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 39; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 39; int swirlid = 0; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 36; bool svp = true; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirl = 36; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 36; int swirlid = 1; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 42; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 42; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 40; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 40; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 37; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 40; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 40; int swirlid = 0; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 37; bool svp = true; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirl = 37; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 37; int swirlid = 1; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 43; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 43; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 41; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 41; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 38; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 38; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 41; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 41; int swirlid = 0; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 38; bool svp = true; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirl = 38; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 38; int swirlid = 1; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 44; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 44; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 42; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 42; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 39; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 39; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 42; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 42; int swirlid = 0; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 39; bool svp = true; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirl = 39; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 39; int swirlid = 1; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 45; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 45; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 43; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 43; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 40; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 40; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 43; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 43; int swirlid = 0; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 40; bool svp = true; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirl = 40; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 40; int swirlid = 1; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 46; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 46; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 44; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 44; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 41; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 41; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 44; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 44; int swirlid = 0; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 41; bool svp = true; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirl = 41; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 41; int swirlid = 1; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 47; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 47; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 45; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 45; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 42; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 42; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 45; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 45; int swirlid = 0; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 42; bool svp = true; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirl = 42; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 42; int swirlid = 1; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 48; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 48; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 46; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 46; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 43; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 43; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 48; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 48; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 45; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 45; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 46; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 46; int swirlid = 0; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 43; bool svp = true; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirl = 43; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 43; int swirlid = 1; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 49; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 49; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 48; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 48; int swirlid = 0; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 45; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 45; int swirlid = 1; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 51; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 51; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 47; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 47; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 44; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 44; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 49; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 49; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 46; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 46; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 47; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 47; int swirlid = 0; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 44; bool svp = true; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 45; bool svp = true; int swirl = 44; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirl = 44; int swirlid = 1; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 50; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 50; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 49; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 49; int swirlid = 0; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 46; bool svp = true; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirl = 46; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 46; int swirlid = 1; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 52; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 52; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 50; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 50; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 47; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 47; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 50; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 50; int swirlid = 0; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 47; bool svp = true; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirl = 47; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 47; int swirlid = 1; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 53; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 53; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 51; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 51; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 48; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 48; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 51; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 51; int swirlid = 0; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 48; bool svp = true; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirl = 48; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 48; int swirlid = 1; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 54; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 54; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 49; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 49; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 0; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 49; bool svp = true; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirl = 49; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 49; int swirlid = 1; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 55; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 55; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 50; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 50; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 0; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 50; bool svp = true; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirl = 50; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 50; int swirlid = 1; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 56; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 56; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 54; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 54; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 51; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 51; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 54; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 54; int swirlid = 0; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 51; bool svp = true; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirl = 51; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 51; int swirlid = 1; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 57; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 57; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 55; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 55; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 55; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 55; int swirlid = 0; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 1; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 58; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 58; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 57; int swirlid = 0; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 53; int swirlid = 1; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 61; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 0; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 53; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 53; int swirlid = 1; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 59; int SWIRLY = 3; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 59; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 58; int swirlid = 0; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 54; int swirlid = 1; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 62; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 56; int swirlid = 0; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 52; bool svp = true; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 53; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 54; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirl = 52; int swirlid = 1; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 60; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 60; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 59; int swirlid = 0; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 55; bool svp = true; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 55; int swirlid = 1; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 63; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 60; int swirlid = 0; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 56; bool svp = true; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 56; int swirlid = 1; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 64; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 61; int swirlid = 0; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 57; bool svp = true; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 57; int swirlid = 1; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 65; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 62; int swirlid = 0; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 58; bool svp = true; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 58; int swirlid = 1; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 66; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 67; int swirlid = 0; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 63; int swirlid = 1; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 71; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 63; int swirlid = 0; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 59; bool svp = true; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 59; int swirlid = 1; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 67; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 68; int swirlid = 0; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 64; int swirlid = 1; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 72; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 64; int swirlid = 0; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 60; bool svp = true; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 60; int swirlid = 1; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 68; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 69; int swirlid = 0; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 65; int swirlid = 1; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 73; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 65; int swirlid = 0; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 61; bool svp = true; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 61; int swirlid = 1; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 69; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 0; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 66; int swirlid = 1; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 74; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 66; bool svp = true; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 66; int swirlid = 0; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 62; bool svp = true; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 63; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 64; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 65; bool svp = true; int swirl = 62; int swirlid = 1; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 70; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 0; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 67; bool svp = true; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 67; int swirlid = 1; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 75; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 72; int swirlid = 0; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 68; bool svp = true; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 68; int swirlid = 1; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 76; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 76; int swirlid = 0; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 71; int swirlid = 1; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 81; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 73; int swirlid = 0; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 69; bool svp = true; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 69; int swirlid = 1; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 77; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 77; int swirlid = 0; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 72; int swirlid = 1; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 82; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 74; int swirlid = 0; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 1; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 78; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 78; int swirlid = 0; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 73; int swirlid = 1; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 83; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 0; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 71; int swirlid = 1; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 79; int SWIRLY = 4; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 79; int swirlid = 0; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 74; int swirlid = 1; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 84; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 75; int swirlid = 0; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 70; bool svp = true; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 71; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 72; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 73; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 74; bool svp = true; int swirl = 70; int swirlid = 1; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 80; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 80; int swirlid = 0; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 75; bool svp = true; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 75; int swirlid = 1; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 85; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 86; int swirlid = 0; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 81; int swirlid = 1; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 91; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 81; int swirlid = 0; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 76; bool svp = true; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 76; int swirlid = 1; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 86; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 87; int swirlid = 0; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 82; int swirlid = 1; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 92; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 82; int swirlid = 0; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 77; bool svp = true; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 77; int swirlid = 1; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 87; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 0; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 83; int swirlid = 1; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 93; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 83; int swirlid = 0; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 78; bool svp = true; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 78; int swirlid = 1; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 88; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 0; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 84; int swirlid = 1; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 94; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 84; int swirlid = 0; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 79; bool svp = true; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 79; int swirlid = 1; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 89; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 90; int swirlid = 0; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 85; int swirlid = 1; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 95; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 95; int swirlid = 0; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 89; int swirlid = 1; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 101; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 85; bool svp = true; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 85; int swirlid = 0; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 80; bool svp = true; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 81; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 82; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 83; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 84; bool svp = true; int swirl = 80; int swirlid = 1; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 90; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 91; int swirlid = 0; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 86; bool svp = true; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 86; int swirlid = 1; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 96; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/bits/stl_algo.h:69: /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_tempbuf.h: In constructor 'std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >; _Tp = std::pair, std::pair >]': /usr/include/c++/13.2.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 96; int swirlid = 0; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 90; int swirlid = 1; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 102; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 92; int swirlid = 0; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 87; bool svp = true; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 87; int swirlid = 1; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 97; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]': /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2363 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2363:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _BidirectionalIterator2 = pair, pair >*; _Distance = int]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2394:20: /usr/include/c++/13.2.1/bits/stl_algo.h:1399:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1399 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1400 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Distance = int; _Pointer = pair, pair >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2424 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2424:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h:2432:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2432 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2433 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2460:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2462 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2463:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2464 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2465 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2466:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2467 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2468 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2469 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 93; int swirlid = 0; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 1; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 98; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1910:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_algo.h:1635:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1635 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1911:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1926:27: /usr/include/c++/13.2.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/13.2.1/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/enum/enumerate_base.h:29, from ../fplll/enum/enumerate_ext.h:22, from enum-parallel/fplll_types.h:29: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 97; int swirlid = 0; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 91; int swirlid = 1; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 103; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 105; int swirlid = 0; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 99; int swirlid = 1; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 111; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 0; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 89; int swirlid = 1; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 99; int SWIRLY = 5; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 98; int swirlid = 0; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 92; int swirlid = 1; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 104; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 94; int swirlid = 0; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 88; bool svp = true; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 89; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 90; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 91; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 92; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirl = 88; int swirlid = 1; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 100; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 106; int swirlid = 0; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 100; int swirlid = 1; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 112; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 99; int swirlid = 0; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 93; bool svp = true; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 93; int swirlid = 1; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 105; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 107; int swirlid = 0; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 101; int swirlid = 1; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 113; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 100; int swirlid = 0; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 94; bool svp = true; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 94; int swirlid = 1; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 106; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 108; int swirlid = 0; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 102; int swirlid = 1; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 114; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 101; int swirlid = 0; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 95; bool svp = true; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 95; int swirlid = 1; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 107; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 109; int swirlid = 0; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 103; int swirlid = 1; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 115; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 102; int swirlid = 0; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 96; bool svp = true; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 96; int swirlid = 1; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 108; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 110; int swirlid = 0; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 104; int swirlid = 1; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 116; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 103; int swirlid = 0; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 97; bool svp = true; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 97; int swirlid = 1; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 109; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 111; int swirlid = 0; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 105; int swirlid = 1; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 117; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 104; bool svp = true; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 105; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 104; int swirlid = 0; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 98; bool svp = true; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 99; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 100; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 101; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 102; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 103; bool svp = true; int swirl = 98; int swirlid = 1; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 110; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 112; int swirlid = 0; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 106; int swirlid = 1; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 118; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 118; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 118; bool svp = true; int swirl = 113; int swirlid = 0; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 107; int swirlid = 1; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 119; int SWIRLY = 6; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::pair >, std::allocator, std::pair > > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 118; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 119; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = true]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 113; bool svp = true; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 114; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 115; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 116; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 117; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 118; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 119; bool svp = true; int swirl = 113; int swirlid = 0; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:415:20, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:421:11, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {}; _Tp = std::pair, std::pair >; _Alloc = std::allocator, std::pair > >]', inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 106; bool svp = true; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:349:44, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 107; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 108; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 109; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 110; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 111; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recur(i_tag) [with int i = 112; bool svp = true; int swirl = 106; int swirlid = 1; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:192:22, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:439:24, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/13.2.1/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:4894:18, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:448:13, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]', inlined from 'void std::inplace_merge(_BIter, _BIter, _BIter, _Compare) [with _BIter = __gnu_cxx::__normal_iterator, pair >*, vector, pair >, allocator, pair > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/13.2.1/bits/stl_algo.h:2640:27, inlined from 'void fplll::enumlib::lattice_enum_t::enumerate_recursive() [with bool svp = true; int N = 120; int SWIRLY = 7; int SWIRLY2BUF = 1024; int SWIRLY1FRACTION = 4; bool findsubsols = false]' at enum-parallel/enumeration.h:450:22, inlined from 'std::array fplll::enumlib::enumerate_dim_detail(int, float_type, std::function, std::function, std::function, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/13.2.1/bits/stl_algo.h:2546:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2546 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2550:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2549 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2550 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2553:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2552 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2553 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/stl_algo.h:2556:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator, std::pair >*, std::vector, std::pair >, std::allocator, std::pair > > > >' changed in GCC 7.1 2555 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2556 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2557 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXXLD libfplll.la CXXLD fplll CXXLD latticegen make[3]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' Making all in tests make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[2]: Nothing to be done for 'all'. make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[2]: Nothing to be done for 'all-am'. make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' Making check in fplll make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make llldiff make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' CXX llldiff.o CXXLD llldiff make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' Making check in tests make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make test_nr test_lll test_enum test_cvp test_svp test_bkz test_pruner test_gso test_lll_gram test_hlll test_svp_gram test_bkz_gram test_counter test_babai test_ceil make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' CXX test_nr.o CXX test_lll.o CXX test_enum.o CXX test_cvp.o CXX test_svp.o CXX test_bkz.o CXX test_pruner.o CXX test_gso.o CXX test_lll_gram.o CXX test_hlll.o CXX test_svp_gram.o CXX test_bkz_gram.o CXX test_counter.o CXX test_babai.o CXX test_ceil.o CXXLD test_ceil CXXLD test_cvp In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from ../fplll/pruner/pruner.h:21, from ../fplll/bkz_param.h:24, from ../fplll/bkz.h:21, from ../fplll/fplll.h:25, from test_svp_gram.cpp:19: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ CXXLD test_nr In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from ../fplll/pruner/pruner.h:21, from ../fplll/bkz_param.h:24, from ../fplll/bkz.h:21, from ../fplll/fplll.h:25, from test_svp.cpp:18: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/nr/numvect.h:20, from ../fplll/nr/matrix.h:21, from ../fplll/gso_interface.h:22, from ../fplll/gso.h:21, from ../fplll/lll.h:21, from ../fplll/pruner/pruner.h:21, from ../fplll/bkz_param.h:24, from ../fplll/bkz.h:21, from ../fplll/fplll.h:25, from test_pruner.cpp:17: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'void set_up_gso_norms(std::vector&)' at test_pruner.cpp:209:30: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_dsvp_reduce(fplll::ZZ_mat&, std::vector, std::allocator > >&) [with ZT = __mpz_struct [1]]' at test_svp_gram.cpp:270:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXXLD test_counter CXXLD test_lll In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/io/json.hpp:56, from test_bkz.cpp:16: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ CXXLD test_hlll In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int test_unpruned() [with FT = fplll::FP_NR<__mpfr_struct [1]>]' at test_pruner.cpp:258:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_bkz_param_pruning(fplll::ZZ_mat&, int, int) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:162:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13.2.1/vector:72, from ../fplll/io/json.hpp:56, from test_bkz_gram.cpp:17: /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_dsvp_reduce(fplll::ZZ_mat&, std::vector, std::allocator > >&) [with ZT = __mpz_struct [1]]' at test_svp.cpp:238:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'int test_bkz_param_linear_pruning(fplll::ZZ_mat&, int, int) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:123:14: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'int test_bkz_param_linear_pruning(fplll::ZZ_mat&, int, int) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:140:43: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_bkz_param_linear_pruning(fplll::ZZ_mat&, int, int) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:144:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int fplll::Pruner::TestPruner::test_enforce() [with FT = fplll::FP_NR]' at test_pruner.cpp:63:22: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'int test_bkz_param(fplll::ZZ_mat&, int, int, std::string) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:78:14: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_bkz_param(fplll::ZZ_mat&, int, int, std::string) [with ZT = __mpz_struct [1]]' at test_bkz.cpp:94:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int test_unpruned() [with FT = fplll::FP_NR]' at test_pruner.cpp:258:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int fplll::Pruner::TestPruner::test_enforce() [with FT = fplll::FP_NR]' at test_pruner.cpp:63:22: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXXLD test_svp_gram CXXLD test_svp In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int test_unpruned() [with FT = fplll::FP_NR]' at test_pruner.cpp:258:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXXLD test_enum In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'int test_unpruned() [with FT = fplll::FP_NR]' at test_pruner.cpp:258:20: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13.2.1/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {nlohmann::basic_json, std::allocator >, bool, long long int, long long unsigned int, double, std::allocator>}; _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]': /usr/include/c++/13.2.1/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ CXXLD test_babai In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {nlohmann::basic_json, std::allocator >, bool, long long int, long long unsigned int, double, std::allocator>}; _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = nlohmann::basic_json<>; _Alloc = std::allocator >]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'void nlohmann::basic_json::push_back(nlohmann::basic_json&&) [with ObjectType = std::map; ArrayType = std::vector; StringType = std::__cxx11::basic_string; BooleanType = bool; NumberIntegerType = long long int; NumberUnsignedType = long long unsigned int; NumberFloatType = double; AllocatorType = std::allocator]' at ../fplll/io/json.hpp:4905:33, inlined from 'nlohmann::basic_json nlohmann::basic_json::parser::parse_internal(bool) [with ObjectType = std::map; ArrayType = std::vector; StringType = std::__cxx11::basic_string; BooleanType = bool; NumberIntegerType = long long int; NumberUnsignedType = long long unsigned int; NumberFloatType = double; AllocatorType = std::allocator]' at ../fplll/io/json.hpp:9157:45: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'int test_auto_prune(size_t) [with FT = fplll::FP_NR]' at test_pruner.cpp:327:16: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {fplll::PruningParams}; _Tp = fplll::PruningParams; _Alloc = std::allocator]', inlined from 'static fplll::Strategy fplll::Strategy::EmptyStrategy(size_t)' at ../fplll/bkz_param.h:52:42, inlined from 'fplll::BKZParam::BKZParam(int, std::vector&, double, int, int, double, double, int, double, double, int)' at ../fplll/bkz_param.h:130:56, inlined from 'int test_bkz(fplll::ZZ_mat&, int, fplll::FloatType, int, int) [with ZT = __mpz_struct [1]]' at test_bkz_gram.cpp:122:12: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {double}; _Tp = double; _Alloc = std::allocator]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = double; _Alloc = std::allocator]' at /usr/include/c++/13.2.1/bits/stl_vector.h:1296:21, inlined from 'int test_auto_prune(size_t) [with FT = fplll::FP_NR]' at test_pruner.cpp:327:16: /usr/include/c++/13.2.1/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXXLD test_bkz_gram CXXLD test_bkz CXXLD test_pruner CXXLD test_lll_gram CXXLD test_gso make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make check-TESTS make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[3]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' PASS: test_nr PASS: test_cvp PASS: test_ceil PASS: test_svp_gram PASS: test_babai PASS: test_gso PASS: test_counter PASS: test_svp PASS: test_enum PASS: test_lll_gram PASS: test_pruner PASS: test_lll PASS: test_hlll PASS: test_bkz_gram PASS: test_bkz ============================================================================ Testsuite summary for fplll 5.4.5 ============================================================================ # TOTAL: 15 # PASS: 15 # SKIP: 0 # XFAIL: 0 # FAIL: 0 # XPASS: 0 # ERROR: 0 ============================================================================ make[3]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[1]: Nothing to be done for 'check-am'. make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' >>> fplll: Entering fakeroot... Making install in fplll make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll' /bin/sh ../libtool --mode=install /usr/bin/install -c libfplll.la '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/enum' /usr/bin/install -c -m 644 fplll_config.h '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll' libtool: install: /usr/bin/install -c .libs/libfplll.so.8.0.1 /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/libfplll.so.8.0.1 libtool: install: (cd /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib && { ln -s -f libfplll.so.8.0.1 libfplll.so.8 || { rm -f libfplll.so.8 && ln -s libfplll.so.8.0.1 libfplll.so.8; }; }) libtool: install: (cd /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib && { ln -s -f libfplll.so.8.0.1 libfplll.so || { rm -f libfplll.so && ln -s libfplll.so.8.0.1 libfplll.so; }; }) libtool: install: /usr/bin/install -c .libs/libfplll.lai /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/libfplll.la libtool: install: /usr/bin/install -c .libs/libfplll.a /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/libfplll.a /usr/bin/install -c -m 644 enum/evaluator.h enum/enumerate.h enum/enumerate_base.h enum/enumerate_ext.h enum/enumerate_ext_api.h '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/enum' libtool: install: chmod 644 /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/libfplll.a .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/pruner' libtool: install: ranlib /home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/libfplll.a /usr/bin/install -c -m 644 pruner/pruner.h pruner/pruner_simplex.h '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/pruner' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/io' /usr/bin/install -c -m 644 io/thread_pool.hpp '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/io' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/nr' /usr/bin/install -c -m 644 nr/dpe.h nr/matrix.h nr/matrix.cpp nr/nr_FP_dd.inl nr/nr_FP_d.inl nr/nr_FP_dpe.inl nr/nr_FP.inl nr/nr_FP_ld.inl nr/nr_FP_misc.inl nr/nr_FP_mpfr.inl nr/nr_FP_qd.inl nr/nr.h nr/nr_rand.inl nr/nr_Z_d.inl nr/nr_Z.inl nr/nr_Z_l.inl nr/nr_Z_misc.inl nr/nr_Z_mpz.inl nr/numvect.h '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/nr' /usr/bin/install -c -m 644 defs.h fplll.h util.h svpcvp.h bkz.h lll.h gso_interface.h gso_gram.h gso.h wrapper.h bkz_param.h householder.h hlll.h threadpool.h '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll/.' make install-data-hook make[3]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' echo "#include " > "./fplll.h.root" /usr/bin/install -c -m 644 "./fplll.h.root" "/home/buildozer/aports/testing/fplll/pkg/fplll/usr/include/fplll.h" rm -f "./fplll.h.root" make[3]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' libtool: warning: remember to run 'libtool --finish /usr/lib' .././install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/bin' /bin/sh ../libtool --mode=install /usr/bin/install -c fplll '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/bin/./armv6-alpine-linux-musleabihf-fplll' libtool: warning: 'libfplll.la' has not been installed in '/usr/lib' libtool: install: /usr/bin/install -c .libs/fplll /home/buildozer/aports/testing/fplll/pkg/fplll/usr/bin/./armv6-alpine-linux-musleabihf-fplll /bin/sh ../libtool --mode=install /usr/bin/install -c latticegen '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/bin/./armv6-alpine-linux-musleabihf-latticegen' libtool: warning: 'libfplll.la' has not been installed in '/usr/lib' libtool: install: /usr/bin/install -c .libs/latticegen /home/buildozer/aports/testing/fplll/pkg/fplll/usr/bin/./armv6-alpine-linux-musleabihf-latticegen make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/fplll' Making install in tests make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[2]: Nothing to be done for 'install-exec-am'. make[2]: Nothing to be done for 'install-data-am'. make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5/tests' make[1]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[2]: Entering directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[2]: Nothing to be done for 'install-exec-am'. ./install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/share/fplll/strategies' ./install-sh -c -d '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/pkgconfig' /usr/bin/install -c -m 644 strategies/default.json '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/share/fplll/strategies' /usr/bin/install -c -m 644 fplll.pc '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/lib/pkgconfig' make[2]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' make[1]: Leaving directory '/home/buildozer/aports/testing/fplll/src/fplll-5.4.5' >>> fplll-static*: Running split function static... >>> fplll-static*: Preparing subpackage fplll-static... >>> fplll-static*: Stripping binaries >>> fplll-static*: Running postcheck for fplll-static >>> fplll-dev*: Running split function dev... >>> fplll-dev*: Preparing subpackage fplll-dev... >>> fplll-dev*: Stripping binaries >>> fplll-dev*: Running postcheck for fplll-dev >>> fplll-libs*: Running split function libs... >>> fplll-libs*: Preparing subpackage fplll-libs... >>> fplll-libs*: Stripping binaries >>> fplll-libs*: Running postcheck for fplll-libs >>> fplll-strategies*: Running split function _strategies... '/home/buildozer/aports/testing/fplll/pkg/fplll/usr/share/fplll/strategies' -> '/home/buildozer/aports/testing/fplll/pkg/fplll-strategies/usr/share/fplll/strategies' >>> fplll-strategies*: Preparing subpackage fplll-strategies... >>> fplll-strategies*: Running postcheck for fplll-strategies >>> fplll*: Running postcheck for fplll >>> fplll*: Preparing package fplll... >>> fplll*: Stripping binaries >>> fplll-dev*: Scanning shared objects >>> fplll-libs*: Scanning shared objects >>> fplll-static*: Scanning shared objects >>> fplll-strategies*: Scanning shared objects >>> fplll*: Scanning shared objects >>> fplll-dev*: Tracing dependencies... fplll-libs=5.4.5-r0 pkgconfig >>> fplll-dev*: Package size: 500.0 KB >>> fplll-dev*: Compressing data... >>> fplll-dev*: Create checksum... >>> fplll-dev*: Create fplll-dev-5.4.5-r0.apk >>> fplll-libs*: Tracing dependencies... so:libc.musl-armhf.so.1 so:libgcc_s.so.1 so:libgmp.so.10 so:libmpfr.so.6 so:libqd.so.0 so:libstdc++.so.6 >>> fplll-libs*: Package size: 20.5 MB >>> fplll-libs*: Compressing data... >>> fplll-libs*: Create checksum... >>> fplll-libs*: Create fplll-libs-5.4.5-r0.apk >>> fplll-static*: Tracing dependencies... >>> fplll-static*: Package size: 38.9 MB >>> fplll-static*: Compressing data... >>> fplll-static*: Create checksum... >>> fplll-static*: Create fplll-static-5.4.5-r0.apk >>> fplll-strategies*: Tracing dependencies... >>> fplll-strategies*: Package size: 8.2 MB >>> fplll-strategies*: Compressing data... >>> fplll-strategies*: Create checksum... >>> fplll-strategies*: Create fplll-strategies-5.4.5-r0.apk >>> fplll*: Tracing dependencies... so:libc.musl-armhf.so.1 so:libfplll.so.8 so:libgcc_s.so.1 so:libgmp.so.10 so:libmpfr.so.6 so:libstdc++.so.6 >>> fplll*: Package size: 140.0 KB >>> fplll*: Compressing data... >>> fplll*: Create checksum... >>> fplll*: Create fplll-5.4.5-r0.apk >>> fplll: Build complete at Sun, 22 Oct 2023 18:18:03 +0000 elapsed time 0h 7m 21s >>> fplll: Cleaning up srcdir >>> fplll: Cleaning up pkgdir >>> fplll: Uninstalling dependencies... (1/7) Purging .makedepends-fplll (20231022.181042) (2/7) Purging gmp-dev (6.3.0-r0) (3/7) Purging libgmpxx (6.3.0-r0) (4/7) Purging mpfr-dev (4.2.1-r0) (5/7) Purging libqd-dev (2.3.23-r2) (6/7) Purging libqd (2.3.23-r2) (7/7) Purging libgfortran (13.2.1_git20231014-r0) Executing busybox-1.36.1-r13.trigger OK: 315 MiB in 102 packages >>> fplll: Updating the testing/armhf repository index... >>> fplll: Signing the index...